Attribute reduction for sequential three-way decisions under dynamic granulation
نویسندگان
چکیده
منابع مشابه
Granular Computing and Sequential Three-Way Decisions
Real-world decision making typically involves the three options of acceptance, rejection and non-commitment. Three-way decisions can be motivated, interpreted and implemented based on the notion of information granularity. With coarse-grained granules, it may only be possible to make a definite decision of acceptance or rejection for some objects. A lack of detailed information may make a defin...
متن کاملMulti-granulation fuzzy probabilistic rough sets and their corresponding three-way decisions over two universes
This article introduces a general framework of multi-granulation fuzzy probabilistic roughsets (MG-FPRSs) models in multi-granulation fuzzy probabilistic approximation space over twouniverses. Four types of MG-FPRSs are established, by the four different conditional probabilitiesof fuzzy event. For different constraints on parameters, we obtain four kinds of each type MG-FPRSs...
متن کاملSequential three-way decision and granulation for cost-sensitive face recognition
Many previous studies on face recognition attempted to seek a precise classifier to achieve a low misclassification error, which is based on an assumption that all misclassification costs are the same. Inmany real-world scenarios, however, this assumption is not reasonable due to the imbalanced misclassification cost and insufficient high-quality facial image information. To address this issue,...
متن کاملThree-Way Decisions in Dynamic Decision-Theoretic Rough Sets
In the previous decision-theoretic rough sets (DTRS), its loss function values are constant. This paper extends the constant values of loss functions to a more realistic dynamic environment. Considering the dynamic change of loss functions in DTRS with the time, an extension of DTRS, dynamic decision-theoretic rough sets (DDTRS) is proposed in this paper. An empirical study of climate policy ma...
متن کاملA Continuous Information Attribute Reduction Algorithm Based on Hierarchical Granulation
The attribute reduction algorithms based on neighborhood approximation usually use the distance as the approximate metric. Algorithms could result in the loss of information with the same distance threshold to construct the neighborhood families of different dimension spaces. Thereby, an attribute reduction algorithm based on hierarchical granulation is proposed. This algorithm can reduce redun...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Approximate Reasoning
سال: 2017
ISSN: 0888-613X
DOI: 10.1016/j.ijar.2017.03.009